|
In mathematics, more specifically in numerical linear algebra, the biconjugate gradient method is an algorithm to solve systems of linear equations : Unlike the conjugate gradient method, this algorithm does not require the matrix to be self-adjoint, but instead one needs to perform multiplications by the conjugate transpose . ==The algorithm== # Choose initial guess , two other vectors and and a preconditioner # # # # # for do ## ## ## ## ## ## ## ## In the above formulation, the computed and satisfy : : and thus are the respective residuals corresponding to and , as approximate solutions to the systems : : is the adjoint, and is the complex conjugate. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Biconjugate gradient method」の詳細全文を読む スポンサード リンク
|